Review of The SIAM 100 - Digit Challenge : A Study in High - Accuracy Numerical Computing
نویسندگان
چکیده
7. Let A be the 20000 × 20000 matrix whose entries are zero everywhere except for the primes 2, 3, 5, 7, · · · , 224737 along the main diagonal and the number 1 in all the positions aij with |i− j| = 1, 2, 4, 8, · · · , 16384. What is the (1, 1) entry of A−1. Lawrence Berkeley National Laboratory, Berkeley, CA 94720. [email protected]. This work was supported by the Director, Office of Computational and Technology Research, Division of Mathematical, Information, and Computational Sciences of the U.S. Department of Energy, under contract number DEAC03-76SF00098.
منابع مشابه
Chebyshev Spectral Collocation Method for Computing Numerical Solution of Telegraph Equation
In this paper, the Chebyshev spectral collocation method(CSCM) for one-dimensional linear hyperbolic telegraph equation is presented. Chebyshev spectral collocation method have become very useful in providing highly accurate solutions to partial differential equations. A straightforward implementation of these methods involves the use of spectral differentiation matrices. Firstly, we transform ...
متن کاملComparison of Machine Learning Algorithms for Broad Leaf Species Classification Using UAV-RGB Images
Abstract: Knowing the tree species combination of forests provides valuable information for studying the forest’s economic value, fire risk assessment, biodiversity monitoring, and wildlife habitat improvement. Fieldwork is often time-consuming and labor-required, free satellite data are available in coarse resolution and the use of manned aircraft is relatively costly. Recently, unmanned aeria...
متن کاملA Note on Solving Problem 7 of the SIAM 100-Digit Challenge Using C-XSC
C-XSC is a powerful C++ class library which simplifies the development of selfverifying numerical software. But C-XSC is not only a development tool, it also provides a lot of predefined highly accurate routines to compute reliable bounds for the solution to standard numerical problems. In this note we discuss the usage of a reliable linear system solver to compute the solution of problem 7 of ...
متن کاملA Review of Numerical Methods for Computing Point and Interval Estimates by S-PLUS Package
For computing different point estimates such as method of moment and maximum like-lihood estimates and different interval estimates (classical confidence interval, unbi-ased confidence interval, HPD interval), we may deal with the equations which need be solved numerically. In this paper, some numerical methods for solving these type of equations are reviewed in S-PLUS package. Various examples...
متن کاملIdentification of Polynomial Chaos Representations in High Dimension from a Set of Realizations
This paper deals with the identification in high dimensions of a polynomial chaos expansion of random vectors from a set of realizations. Due to numerical and memory constraints, the usual polynomial chaos identification methods are based on a series of truncations that induce a numerical bias. This bias becomes very detrimental to the convergence analysis of polynomial chaos identification in ...
متن کامل